A Recursive Method for Computing Zeta Functions of Varieties
نویسندگان
چکیده
منابع مشابه
A recursive method for computing zeta functions of varieties
We present a method for calculating the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. Specifically, we outline an algorithm which reduces the problem of calculating a numerical approximation for the action of Frobenius on the middle-dimensional rigid cohomology of a smooth variety, to that of performing the same calculation for a ...
متن کاملStringy Zeta Functions for Q–gorenstein Varieties
The stringy Euler number and stringy E–function are interesting invariants of log terminal singularities, introduced by Batyrev. He used them to formulate a topological mirror symmetry test for pairs of certain Calabi–Yau varieties, and to show a version of the McKay correspondence. It is a natural question whether one can extend these invariants beyond the log terminal case. Assuming the Minim...
متن کاملComputing Zeta Functions of Nondegenerate Curves
In this paper we present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since in practice all known cases, e.g. hyperelliptic, superelliptic and Cab curves, can be transformed to fit the nondegenerate case. For curves with a fixed Newton polytope, the property of being no...
متن کاملQuantum Computing and Zeroes of Zeta Functions
A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the spectral approach to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to the eigenvalues of finite dimensional unitary operators of natural quantum mechanical systems. The notion of universal, efficient quantum computation is used ...
متن کاملComputing zeta functions of sparse nondegenerate hypersurfaces
Using the cohomology theory of Dwork, as developed by Adolphson and Sperber, we exhibit a deterministic algorithm to compute the zeta function of a nondegenerate hypersurface defined over a finite field. This algorithm is particularly well-suited to work with polynomials in small characteristic that have few monomials (relative to their dimension). Our method covers toric, affine, and projectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2006
ISSN: 1461-1570
DOI: 10.1112/s1461157000001261